An adaptative bacterial foraging optimization algorithm for solving the MRCPSP with discounted cash flows

نویسندگان

چکیده

In this paper, a metaheuristic solution algorithm for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with discounted cash flows (MRCPSPDC) is proposed. This consists of determining schedule such that completed, maximizing project’s net present value (NPV) while complying delivery deadline. The adaptative bacterial foraging optimization (ABFO) variation original (BFO), which nature-inspired algorithm. We implement version chemotactic operator based on double justification activities given flow. has been tested in PSPLIB and MMLIB benchmark datasets available literature promising results. Our ABFO shows excellent performance all instances provides suitable solutions MRCPSP NPV.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Investment Problem with Discounted Cash Flows

A resource investment problem is a project-scheduling problem in which the availability levels of the resources are considered as decision variables and the goal is to find a schedule, and resource requirement levels, such that some objective function optimizes. In this paper, we consider a resource investment problem in which the goal is to maximize the net present value of the project cash fl...

متن کامل

Resource Investment Problem With Discounted Cash Flows

A resource investment problem is a project-scheduling problem in which the availability levels of the resources are considered decision variables and the goal is to find a schedule and resource requirement levels such that some objective function optimizes. In this paper, we consider a resource investment problem in which the goal is to maximize the net present value of the project cash flows. ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A genetic algorithm for resource investment problem with discounted cash flows

A Resource Investment Problem with Discounted Cash Flows is a project scheduling problem in which the availability levels of the resources are considered decision variables and the goal is to find a schedule and resource requirement levels such that the net present value of the project cash flows optimizes. In this paper, we present a genetic algorithm to solve this problem. We explain the elem...

متن کامل

Solving a multi-objective multi-mode resource-constrained project scheduling problem with discounted cash flows

This paper presents a multi-objective multi-mode resource-constrained project scheduling problem (MRCPSP) with positive and negative cash flows. We consider the objectives of the net present value (NPV) maximization and robustness maximization along by makespan minimization. Furthermore, to make a model close to the real world situations, two types of commonly used payment models are considered...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Top

سال: 2021

ISSN: ['1134-5764', '1863-8279']

DOI: https://doi.org/10.1007/s11750-021-00612-2